Parametric bootstrapping for biological sequence motifs
نویسندگان
چکیده
منابع مشابه
Parametric inference for biological sequence analysis.
One of the major successes in computational biology has been the unification, by using the graphical model formalism, of a multitude of algorithms for annotating and comparing biological sequences. Graphical models that have been applied to these problems include hidden Markov models for annotation, tree models for phylogenetics, and pair hidden Markov models for alignment. A single algorithm, ...
متن کاملInverse Parametric Alignment for Accurate Biological Sequence Comparison
For as long as biologists have been computing alignments of sequences, the question of what values to use for scoring substitutions and gaps has persisted. In practice, substitution scores are usually chosen by convention, and gap penalties are often found by trial and error. In contrast, a rigorous way to determine parameter values that are appropriate for aligning biological sequences is by s...
متن کاملBootstrapping the Conditional Moment Test for Parametric Duration Models
This letter evaluates the performance of auxiliary regression-based specification tests for parametric duration models estimated with censored data. The test using asymptotic critical values has poor size. Bootstrapping corrects the size problem but results in a biased power curve.
متن کاملMotifs in biological networks
Current progress in molecular biology, particularly in genome sequencing and highthroughput technologies, have led to an unprecedented growth in data. The availability of detailed molecular data allows the reconstruction of the structure and dynamic of biological processes and systems. This transition from the molecular level to the systems level is necessary for an understanding of the functio...
متن کاملBounds for Parametric Sequence Comparison
We consider the problem of computing a global alignment between two or more sequences subject to varying mismatch and indel penalties. We prove a tight 3(n=2 )+O(n log n) bound on the worst-case number of distinct optimum alignments for two sequences of length n as the parameters are varied. This re7nes a O(n) upper bound by Gus7eld et al., answering a question posed by Pevzner and Waterman. Ou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2016
ISSN: 1471-2105
DOI: 10.1186/s12859-016-1246-8